The Sojourn Time Distribution in an Infinite Server Resequencing Queue with Dependent Interarrival and Service Times
نویسندگان
چکیده
We consider an infinite server resequencing queue, where arrivals are generated by jumps of a semi-Markov process and service times depend on the jumps of this process. The stationary distribution of the sojourn time, conditioned on the state of the semi-Markov process, is obtained both for the case of hyperexponential service times and for the case of a Markovian arrival process. For the general model, an accurate approximation is derived based on a discretisation of interarrival and service times.
منابع مشابه
Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates
This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...
متن کاملA Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers
In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...
متن کاملQueue with Heterogeneous Server Under Resequencing Constraint
In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.?
متن کاملProcessor-sharing and Random-service Queues with Semi-markovian Arrivals
We consider single-server queues with exponentially distributed service times, in which the arrival process is governed by a semi-Markov process (SMP). Two service disciplines, processor sharing (PS) and random service (RS), are investigated. We note that the sojourn time distribution of a type-l customer who, upon his arrival, meets k customers already present in the SMP/M/1/PS queue is identi...
متن کاملUnreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service
This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...
متن کامل